Consistent Multiple Graph Embedding for Multi-View Clustering
نویسندگان
چکیده
Graph-based multi-view clustering aiming to obtain a partition of data across multiple views, has received considerable attention in recent years. Although great efforts have been made for graph-based clustering, it is still challenging fuse characteristics from various views learn common representation clustering. In this paper, we propose novel Consistent Multiple Graph Embedding Clustering framework (CMGEC). Specifically, graph auto-encoder (M-GAE) designed flexibly encode the complementary information using multi-graph fusion encoder. To guide learned maintaining similarity neighboring each view, Multi-view Mutual Information Maximization module (MMIM) introduced. Furthermore, network (GFN) devised explore relationship among graphs different and provide consensus needed M-GAE. By jointly training these models, can be obtained, which encodes more depicts comprehensively. Experiments on three types datasets demonstrate CMGEC outperforms state-of-the-art methods.
منابع مشابه
Multi-view Clustering with Adaptively Learned Graph
Multi-view clustering, which aims to improve the clustering performance by exploring the data’s multiple representations, has become an important research direction. Graph based methods have been widely studied and achieve promising performance for multi-view clustering. However, most existing multi-view graph based methods perform clustering on the fixed input graphs, and the results are depen...
متن کاملCross-view Graph Embedding
Recently, more and more approaches are emerging to solve the cross-view matching problem where reference samples and query samples are from different views. In this paper, inspired by Graph Embedding, we propose a unified framework for these cross-view methods called Cross-view Graph Embedding. The proposed framework can not only reformulate most traditional cross-view methods (e.g., CCA, PLS a...
متن کاملGraph Clustering with Dynamic Embedding
Graph clustering (or community detection) has long drawn enormous aention from the research on web mining and information networks. Recent literature on this topic has reached a consensus that node contents and link structures should be integrated for reliable graph clustering, especially in an unsupervised setting. However, existing methods based on shallow models oen suer from content nois...
متن کاملLarge-Scale Multi-View Spectral Clustering via Bipartite Graph
In this paper, we address the problem of large-scale multi-view spectral clustering. In many real-world applications, data can be represented in various heterogeneous features or views. Different views often provide different aspects of information that are complementary to each other. Several previous methods of clustering have demonstrated that better accuracy can be achieved using integrated...
متن کاملVariational Graph Embedding for Globally and Locally Consistent Feature Extraction
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn features that account for both types of information based on variational optimization of nonparametric learning criteria. Using mutual information and Bayes error rate as example criteria, we show that high-quality featu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Multimedia
سال: 2023
ISSN: ['1520-9210', '1941-0077']
DOI: https://doi.org/10.1109/tmm.2021.3136098